A literature survey of benchmark functions for global optimisation problems

نویسندگان

  • Momin Jamil
  • Xin-She Yang
چکیده

Test functions are important to validate and compare the performance of optimization algorithms. There have been many test or benchmark functions reported in the literature; however, there is no standard list or set of benchmark functions. Ideally, test functions should have diverse properties so that can be truly useful to test new algorithms in an unbiased way. For this purpose, we have reviewed and compiled a rich set of 175 benchmark functions for unconstrained optimization problems with diverse properties in terms of modality, separability, and valley landscape. This is by far the most complete set of functions so far in the literature, and tt can be expected this complete set of functions can be used for validation of new optimization in the future.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated weighted boosting search for discrete or mixed search space and multiple-objective optimisation

Repeated weighted boosting search (RWBS) optimisation is a guided stochastic search algorithm that is capable of handling the difficult optimisation problems with non-smooth and/or multi-modal cost functions. Compared with other alternatives for global optimisation solvers, such as the genetic algorithms and adaptive simulated annealing, RWBS is easier to implement, has fewer algorithmic parame...

متن کامل

Default policies for global optimisation of noisy functions with severe noise

Global optimisation of unknown noisy functions is a daunting task that seems to appear in domains ranging from games to control problems to meta-parameter optimisation for machine learning. We show how to incorporate heuristics to Stochastic Simultaneous Optimistic Optimization (STOSOO), a global optimisation algorithm that has very weak requirements from the function. In our case, heuristics c...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

Modified Sine-Cosine Algorithm for Sizing Optimization of Truss Structures with Discrete Design Variables

This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...

متن کامل

A Hybrid Harmony Search Algorithm for Solving Dynamic Optimisation Problems

Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to seek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJMNO

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2013